Checking termination of bottom-up evaluation of logic programs with function symbols
نویسندگان
چکیده
منابع مشابه
Checking termination of bottom-up evaluation of logic programs with function symbols
Recently, there has been an increasing interest in the bottom-up evaluation of the semantics of logic programs with complex terms. The presence of function symbols in the program may render the ground instantiation infinite, and finiteness of models and termination of the evaluation procedure, in the general case, are not guaranteed anymore. Since the program termination problem is undecidable ...
متن کاملChecking Termination of Logic Programs with Function Symbols through Linear Constraints
Enriching answer set programming with function symbols makes modeling easier, increases the expressive power, and allows us to deal with infinite domains. However, this comes at a cost: common inference tasks become undecidable. To cope with this issue, recent research has focused on finding trade-offs between expressivity and decidability by identifying classes of logic programs that impose li...
متن کاملChecking Termination of Datalog with Function Symbols Through Linear Constraints
Enriching Datalog programs with function symbols makes modeling easier, increases the expressive power, and allows us to deal with infinite domains. However, this comes at a cost: common inference tasks become undecidable. To cope with this issue, recent research has focused on finding trade-offs between expressivity and decidability by identifying classes of logic programs that impose limitati...
متن کاملChecking Termination of Queries to Logic Programs
Termination of programs is known to be undecidable. However in the case of logic programs , where the only possible cause for non-termination is innnite recursion, termination can actually be proved automatically for a large class of programs. This paper describes an algorithm for automatically checking termination of queries to logic programs. Given a program and query the algorithm either ans...
متن کاملRule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs
Logic programs can be evaluated bottom-up by repeatedly applying all rules, in “iterations”, until the fixpoint is reached. However, it is often desirable — and in some cases, e.g. programs with stratified negation, even necessary to guarantee the semantics — to apply the rules in some order. An important property of a fixpoint evaluation algorithm is that it does not repeat inferences; we say ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2014
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068414000623